Location:
Search - big integer
Search list
Description: 大整数的又一种操作-Big Integer another operation
Platform: |
Size: 25711 |
Author: 杨向前 |
Hits:
Description: 大数相乘，可以解决超过大整数的问题-multiply large numbers, can be resolved over the issue of large integer
Platform: |
Size: 33565 |
Author: 李林骏 |
Hits:
Description: RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s <= n, 通常取 s = 2^t), 则每一位数均小于 n, 然後分段编码...... 接下来, 计算 b == a^m mod n, (0 <= b < n), b 就是编码后的资料。解码的过程是, 计算 c == b^r mod pq (0 <= c < pq), 于是, 解码完毕-RSA algorithm : First, find a few 3, p, q, r, p, q is the two different prime number, with the r (p-1) (q-1) coprime several ... p, q, r it person_key number is three, and then find m, making r ^ m == a mod (p-1) (q-1 m ...................................... this must exist, because r (p-1) (q - 1) coprime, with the division algorithm can be a ..... Next, calculate n = pq ....... m, n is the number two public_key, coding process is that if a data and to treat it as a big Integer assuming a <n. ... If a> = n, a table will be rounding into s (s <= n, usually from 2 ^ s = t), each n is less than the median, and then sub-coding ..... . Next, calculate a == b ^ m mod n, (0 <= b <n), b is encoded information. Decoding is the process of calculating c == b ^ r mod pq (0 <= c &
Platform: |
Size: 1393 |
Author: 胡康康 |
Hits:
Description: Library for Manipulating Big Integers
Platform: |
Size: 47445 |
Author: sam99gao |
Hits:
Description: 大整数的又一种操作-Big Integer another operation
Platform: |
Size: 25600 |
Author: 杨向前 |
Hits:
Description: 大数相乘，可以解决超过大整数的问题-multiply large numbers, can be resolved over the issue of large integer
Platform: |
Size: 32768 |
Author: 李林骏 |
Hits:
Description: RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s <= n, 通常取 s = 2^t), 则每一位数均小于 n, 然後分段编码...... 接下来, 计算 b == a^m mod n, (0 <= b < n), b 就是编码后的资料。解码的过程是, 计算 c == b^r mod pq (0 <= c < pq), 于是, 解码完毕-RSA algorithm : First, find a few 3, p, q, r, p, q is the two different prime number, with the r (p-1) (q-1) coprime several ... p, q, r it person_key number is three, and then find m, making r ^ m == a mod (p-1) (q-1 m ...................................... this must exist, because r (p-1) (q- 1) coprime, with the division algorithm can be a ..... Next, calculate n = pq ....... m, n is the number two public_key, coding process is that if a data and to treat it as a big Integer assuming a <n. ... If a> = n, a table will be rounding into s (s <= n, usually from 2 ^ s = t), each n is less than the median, and then sub-coding ..... . Next, calculate a == b ^ m mod n, (0 <= b <n), b is encoded information. Decoding is the process of calculating c == b ^ r mod pq (0 <= c &
Platform: |
Size: 1024 |
Author: 胡康康 |
Hits:
Description: 这是一个大整数计算的源代码，可以输入任意长的2个整数，计算他们的和-This is a big integer calculation of the source code, you can enter any length of two integers, and the calculation of their
Platform: |
Size: 99328 |
Author: liuweigao |
Hits:
Description: 本代码是一个大整数类的定义，采用函数重载实现，可以定义任意大的整数。-This code is a big integer class definition, the use of function overloading to achieve, can be defined arbitrarily large integer.
Platform: |
Size: 4096 |
Author: kevin |
Hits:
Description: 对于比32位还要大的数进行运算，本程序可以实现大整数运算。-For more than 32 but also the number of large operations, the program can realize big integer calculations.
Platform: |
Size: 2048 |
Author: 秦成康 |
Hits:
Description: 一个基于c#的大整数类，内含各种大整数的操作-Based on the c# Big integer type that contains a variety of large integer operations
Platform: |
Size: 26624 |
Author: xi |
Hits:
Description: 128位大整数运算源代码
源代码包含128位大整数的加减乘除、取模、乘幂、2进制和10进制转换等运算，可用于大整数运算和加解密算法。
-128 large integer computing source code source code contains 128 large integer addition and subtraction, multiplication and division, modulus, by power, 2-band and 10 hexadecimal conversion operator can be used for big integer calculations and processing decryption algorithm.
Platform: |
Size: 3072 |
Author: 夏 |
Hits:
Description: Addition, subtraction and multiplication of big integer numbers, using string.
Platform: |
Size: 175104 |
Author: Mehdi Isaloo |
Hits:
Description: big integer implementing-big integer implementing...
Platform: |
Size: 17408 |
Author: SiyavashGhanbari |
Hits:
Description: 用C语言解决了大数相乘的问题，CPU时间为16ms，内存战用420kb-Calculate A × B
But A and B may be big integer.
The biggest integer is less than 10^500.
Platform: |
Size: 1024 |
Author: xiaoxue |
Hits:
Description: 大整数实现500000位的运算，可以改进进行压缩加密算法。-Big Integer 500 000 operations , and can improve the compression and encryption algorithms .
Platform: |
Size: 431104 |
Author: 刘乐 |
Hits:
Description: big integer addition
Platform: |
Size: 12288 |
Author: Rahul Deb Mohalder |
Hits:
Description: C语言实现大整数的运算，包括加减乘除四种运算，适合初学者使用-C language implementation of large integer arithmetic, including addition and subtraction, multiplication and division operations, suitable for beginners
Platform: |
Size: 1024 |
Author: fl |
Hits:
Description: 用C语言解决了大数相乘的问题，CPU时间为16ms，内存战用420kb-Calculate A × B But A and B may be big integer.The biggest integer is less than 10^500.
Platform: |
Size: 1024 |
Author: xie271359 |
Hits:
Description: Big Integer For C# Source
Platform: |
Size: 25600 |
Author: BKITbaby |
Hits: